Computational Models for Ultrametric Spaces
نویسندگان
چکیده
منابع مشابه
Vector ultrametric spaces and a fixed point theorem for correspondences
In this paper, vector ultrametric spaces are introduced and a fixed point theorem is given for correspondences. Our main result generalizes a known theorem in ordinary ultrametric spaces.
متن کاملIndivisible Ultrametric Spaces
Ametric space is indivisible if for any partition of it into finitely many pieces one piece contains an isometric copy of the whole space. Continuing our investigation of indivisible metric spaces [1], we show that a countable ultrametric space embeds isometrically into an indivisible ultrametric metric space if and only if it does not contain a strictly increasing sequence of balls.
متن کاملAsynchronous iterations in ultrametric spaces
Some iterative calculations can be carried out by parallel communicating processors, and yield the same results whether or not the processors are synchronized. We show that this is the case if and only if the iteration is a contraction that is strict on orbits, with respect to an ultrametric defined on the state space. The maximum number of independent processors is given by the dimension of th...
متن کاملCompleteness in Generalized Ultrametric Spaces
Γ-ultrametric spaces are spaces which satisfy all the axioms of an ultrametric space except that the distance function takes values in a complete lattice Γ instead of R≥0. Γ-ultrametric spaces have been extensively studied as a way to weaken the notion of an ultrametric space while still providing enough structure to be useful (see for example [17], [18], [8]). The many uses of Γ-ultrametric sp...
متن کاملUltrametric Spaces in Continuous Logic
We investigate the continuous model theory of ultrametric spaces of diameter ≤ 1. There is no universal Polish ultrametric space of diameter 1; but there is a Polish ultrametric space, Umax, taking distances in Q∩[0, 1], which is universal for all such Polish ultrametric spaces. We show that in the continuous theory of Umax, nonforking is characterized by a stable independence relation, which i...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Electronic Notes in Theoretical Computer Science
سال: 1997
ISSN: 1571-0661
DOI: 10.1016/s1571-0661(05)80164-1